Papers with graph convolutional network
Graph Attention Network with Memory Fusion for Aspect-level Sentiment Analysis (2020.aacl-main)
Copied to clipboard
| Challenge: | Recent studies ignored the syntactic relationship between the aspect and its corresponding context words, leading the model to focus on syntaktically unrelated words mistakenly. |
| Approach: | They propose to extend the graph convolutional network by assigning different weights to edges of connected words. |
| Outcome: | The proposed method can improve on five datasets showing that it learns and exploits multiword relations and draws different weights of words to improve performance. |
Improving Language Generation from Feature-Rich Tree-Structured Data with Relational Graph Convolutional Encoders (D19-63)
Copied to clipboard
| Challenge: | The goal of the multilingual surface realization shared task is to generate fluent text from UD structures. |
| Approach: | They propose to use a graph convolutional network to encode the dependency trees given as input. |
| Outcome: | The proposed system achieves the third rank without data augmentation techniques or additional components. |
MELOV: Multimodal Entity Linking with Optimized Visual Features in Latent Space (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to multimodal entity linking focus on textual contexts but lack in social media vision modality. |
| Approach: | They propose a latent space vision feature optimization framework MELOV to address these challenges . they exploit variational autoencoder to mine shared information and generate text-based visual features . |
| Outcome: | The proposed framework is superior to existing methods on three benchmark datasets. |
TECHS: Temporal Logical Graph Networks for Explainable Extrapolation Reasoning (2023.acl-long)
Copied to clipboard
| Challenge: | Existing frameworks for extrapolating knowledge graphs are incomplete and do not represent real-world knowledge. |
| Approach: | They propose an explainable extrapolation reasoning framework that integrates propositional reasoning and first-order reasoning by introducing a reasoning graph that iteratively expands to find the answer. |
| Outcome: | The proposed framework outperforms state-of-the-art baselines in explaining future facts based on past counterparts. |
Joint Type Inference on Entities and Relations via Graph Convolutional Networks (P19-1)
Copied to clipboard
| Challenge: | a novel graph convolutional network (GCN) is proposed for the task of joint entity relation extraction. |
| Approach: | They propose a graph convolutional network running on an entity-relation bipartite graph . they propose combining two different methods to perform joint entity relation extraction . |
| Outcome: | The proposed model outperforms existing joint models in entity performance and is competitive with the state-of-the-art in relation performance. |
Auxiliary Knowledge-Induced Learning for Automatic Multi-Label Medical Document Classification (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for ICD indexing use machine learning to assign subset of codes to medical records . experimental results show proposed method achieves state-of-the-art performance on a number of measures. |
| Approach: | They propose a method that uses a deep dilated residual convolution encoder to learn document representations across different lengths of the texts. |
| Outcome: | The proposed method achieves state-of-the-art performance on a number of measures. |
Supporting Medical Relation Extraction via Causality-Pruned Semantic Dependency Forest (2022.coling-1)
Copied to clipboard
| Challenge: | Medical relation extraction (MRE) tasks aims to extract relations between entities in medical literature. |
| Approach: | They propose to combine semantic and syntactic information from medical texts by using causal explanation theory. |
| Outcome: | Empirically, the proposed model outperforms existing methods on benchmark medical datasets. |
PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Text (D19-1)
Copied to clipboard
| Challenge: | Experimentally PullNet improves over the prior state-of-the-art open domain question answering systems. |
| Approach: | They propose a framework for learning what to retrieve and reasoning with heterogeneous information to find the best answer. |
| Outcome: | The proposed framework improves over the prior state-of-the-art in open domain question answering . it is weakly supervised, requiring question-answer pairs but not gold inference paths . |
Syntactic Graph Convolutional Network for Spoken Language Understanding (2020.coling-main)
Copied to clipboard
| Challenge: | Existing work on slot filling and intent detection builds joint models without prior knowledge of linguistic knowledge. |
| Approach: | They propose a joint model that integrates syntactic structure for learning slot filling and intent detection jointly. |
| Outcome: | The proposed model outperforms existing models on two public benchmark datasets and further improves on slot filling and intent detection. |
Twitter Homophily: Network Based Prediction of User’s Occupation (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to predicting Twitter users' demographic attributes exploit, select, and combine various features generated from text and network to achieve the best performance. |
| Approach: | They extend existing Twitter occupational class prediction data set and exploit social network homophily to achieve competitive performance. |
| Outcome: | The proposed method achieves better performance on a dataset with a small fraction of the training data. |
HyperCore: Hyperbolic and Co-graph Representation for Automatic ICD Coding (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for ICD coding ignore Code Hierarchy and Code Co-occurrence . cost of manual coding estimated to be $25 billion per year in the US . |
| Approach: | They propose a hyperbolic representation method to leverage the code hierarchy and a graph convolutional network to utilize the code co-occurrence. |
| Outcome: | The proposed model outperforms state-of-the-art methods on two widely used datasets. |
Inductive Relation Prediction with Logical Reasoning Using Contrastive Representations (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for relation prediction in knowledge graphs (KGs) are limited by the inductive setting because entities in training process are finite. |
| Approach: | They propose a graph convolutional network-based model LogCo with logical reasoning by contrastive representations that extracts subgraphs and relational paths between two entities to supply the entity-independence. |
| Outcome: | The proposed model outperforms existing methods on twelve inductive datasets. |
Enhancing Cross-target Stance Detection with Transferable Semantic-Emotion Knowledge (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for stance detection are struggling to cope with the data across targets. |
| Approach: | They propose a model that uses external knowledge as a bridge to enable knowledge transfer across different targets. |
| Outcome: | The proposed model outperforms existing methods on a large real-world dataset. |
SSEGCN: Syntactic and Semantic Enhanced Graph Convolutional Network for Aspect-based Sentiment Analysis (2022.naacl-main)
Copied to clipboard
| Challenge: | Aspect-based Sentiment Analysis (ABSA) aims to predict sentiment polarity towards aspects in sentences . a novel model for ABSA is proposed, but how to harness it is still a challenge . |
| Approach: | They propose a syntactic and semantic enhanced Graph Convolutional Network (SSEGCN) model for ABSA task using aspect-aware attention mechanism and self-attention. |
| Outcome: | The proposed model outperforms state-of-the-art methods on benchmark datasets. |
Deep Reinforcement Learning-based Dialogue Policy with Graph Convolutional Q-network (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for deep reinforcement learning lack the ability to learn the relationship between dialogue states and actions. |
| Approach: | They propose a graph-structured dialogue policy framework for task-oriented dialogue systems that uses bipartite graphs to construct two different bipartites and generate user-related and knowledge-related subgraphs. |
| Outcome: | The proposed framework significantly improves the effectiveness and stability of dialogue policies. |
DynaEval: Unifying Turn and Dialogue Level Evaluation (2021.acl-long)
Copied to clipboard
Chen Zhang, Yiming Chen, Luis Fernando D’Haro, Yan Zhang, Thomas Friedrichs, Grandee Lee, Haizhou Li
| Challenge: | Existing evaluation metrics focus on the turn-level quality of a dialogue . a unified framework that holistically considers the quality of the entire dialogue is needed . |
| Approach: | They propose a unified automatic evaluation framework which holistically considers the quality of the entire dialogue. |
| Outcome: | The proposed framework outperforms the state-of-the-art dialogue coherence model and correlates strongly with human judgements across multiple evaluation aspects at both turn and dialogue level. |
Enhancing Generalization in Natural Language Inference by Syntax (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Pre-trained language models such as BERT have the state-of-the-art performance on natural language inference (NLI). |
| Approach: | They propose to use dependency trees to enhance generalization of BERT in a natural language inference task by leveraging on a graph convolutional network to represent a syntax-based matching graph with heterogeneous matching patterns. |
| Outcome: | The proposed method makes BERT more robust on syntactic changes. |
Modeling Conversation Structure and Temporal Dynamics for Jointly Predicting Rumor Stance and Veracity (D19-1)
Copied to clipboard
| Challenge: | Existing methods to verify rumors are needed to identify false rumors. |
| Approach: | They propose a hierarchical multi-task learning framework for jointly predicting rumor stance and veracity on Twitter that exploits the temporal dynamics of stance evolution. |
| Outcome: | The proposed framework outperforms previous methods on two benchmark datasets showing that it can predict rumor stance and veracity. |
AoM: Detecting Aspect-oriented Information for Multimodal Aspect-Based Sentiment Analysis (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to extract aspects from text-image pairs and recognize their sentiments are noisy and coarsely establishing image-aspect alignment will interfere with aspect-relevant semantic and sentiment information. |
| Approach: | They propose an Aspect-oriented method to detect aspect-relevant semantic and sentiment information by selecting textual tokens and image blocks that are semantically related to the aspects. |
| Outcome: | The proposed method is superior to existing methods in the field of sentiment analysis. |
Reasoning Over Semantic-Level Graph for Fact Checking (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for fact checking use string concatenation or fusing features of isolated evidence sentences. |
| Approach: | They propose a method suitable for reasoning about the semantic-level structure of evidence . they use graph convolutional network and graph attention network to exploit the structure . |
| Outcome: | The proposed method improves claim verification accuracy and FEVER score on a benchmark dataset. |
Aspect-Level Sentiment Analysis Via Convolution over Dependency Tree (D19-1)
Copied to clipboard
| Challenge: | Existing methods to identify sentiment polarity of opinion words are cumbersome due to the amount of opinionated material on the internet. |
| Approach: | They propose a method to identify sentiment polarity of opinion words on a specific aspect of a sentence using neural networks. |
| Outcome: | The proposed method is the state-of-the-art in aspect-based sentiment classification. |
Bipartite Flat-Graph Network for Nested Named Entity Recognition (2020.acl-main)
Copied to clipboard
| Challenge: | Existing models only consider the unidirectional delivery of information from innermost layers to outer ones, but instead focus on nested entities. |
| Approach: | They propose a bipartite flat-graph network (BiFlaG) for nested named entity recognition (NER) the bipartites are bidirectional LSTM and graph convolutional network (GCN) they first use the entities recognized by the flat NER module to construct an entity graph . |
| Outcome: | The proposed model outperforms existing models on three standard nested NER datasets. |
Matching Article Pairs with Graphical Decomposition and Convolutions (P19-1)
Copied to clipboard
| Challenge: | Existing methods for matching sentence pairs do not perform well in longer documents . Existing approaches for matching sentences do not work in longer document understanding tasks . |
| Approach: | They propose to model article pairs by comparing sentences that enclose same concept vertex . they propose to use a concept interaction graph to match articles by encoding sentences . |
| Outcome: | The proposed methods show significant improvements over existing methods . the proposed datasets consist of 30K pairs of breaking news articles . |
An Empirical Study on Leveraging Position Embeddings for Target-oriented Opinion Words Extraction (2021.emnlp-main)
Copied to clipboard
| Challenge: | Current methods for extracting opinion words for an aspect in text leverage position embeddings to capture relative position of word to the target. |
| Approach: | They propose to use pretrained word embeddings to extract opinion words for a given aspect in text. |
| Outcome: | The proposed methods outperform current methods on a task based on pre-trained word embeddings and position embedders. |
DrKGC: Dynamic Subgraph Retrieval-Augmented LLMs for Knowledge Graph Completion across General and Biomedical Domains (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Knowledge graph completion (KGC) aims to predict missing triples in knowledge graphs . current approaches encode graph context in textual form, which fails to exploit its potential . |
| Approach: | a new method is proposed to predict missing triples in knowledge graphs by leveraging existing triples and textual information. |
| Outcome: | The proposed model learns structural embeddings and logical rules within the KG and extracts a subgraph for each query guided by the learned rules. |